Approximation Algorithms for Time-Dependent Orienteering
نویسندگان
چکیده
The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. For any ε > 0, we provide a (2 + ε)-approximation algorithm for the time-dependent orienteering problem which runs in polynomial time if the ratio between the maximum and minimum traveling time between any two sites is constant. No prior upper approximation bounds were known for this time-dependent problem. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Approximation Algorithms for P2P Orienteering and Stochastic Vehicle Routing Problem
We consider the P2P orienteering problem on general metrics and present a (2+ε) approximation algorithm. In the stochastic P2P orienteering problem we are given a metric and each node has a fixed reward and random size. The goal is to devise a strategy for visiting the nodes so as to maximize the expected value of the reward without violating the budget constraints. We present an approximation ...
متن کاملPoly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed k-TSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ |V |, compute the minimum length tour that contains r and at least k other vertices. We present a polynomial time O(log n · log k)-approximation algorithm for this problem. We use this algorithm for directed k-TSP t...
متن کاملCompact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
We develop polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle routing problem (RVRP) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward r-rooted path, possibly ending at a specified node, of length at most some given budget B. In RVRP, the goa...
متن کاملApproximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T , find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified ti...
متن کاملApproximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the first constant-factor approximation algorithm for the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edges and prizes (rewards) on nodes, and a start node s. In the Orienteering Problem, the goal is to find a path that maximizes the rewa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 83 شماره
صفحات -
تاریخ انتشار 2001